Unit propagation - PDFSEARCH.IO - Document Search Engine

Unit propagation
Results: 62

#	Item
31	Efficient CNF Simplification based on Binary Implication Graphs⋆ Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-06-03 17:52:43 Propositional calculus Automated theorem proving Mathematical logic Logic in computer science NP-complete problems Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Logic Mathematics
32	Mechanical Verification of SAT Refutations with Extended Resolution Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt Jr. ⋆ The University of Texas at Austin Abstract. We present a mechanically-verified proof che Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2013-07-31 07:11:51 Logic Unit propagation Resolution Conjunctive normal form Clause Literal ACL2 Logic programming First-order logic Theoretical computer science Mathematical logic Automated theorem proving
33	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
34	Blocked Clause Decomposition Marijn J. H. Heule? and Armin Biere?? The University of Texas at Austin and Johannes Kepler University Linz Abstract. We demonstrate that it is fairly easy to decompose any propositional form Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:11:30 Automated theorem proving Propositional calculus Boolean algebra Mathematical logic Logic in computer science Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Mathematics Logic
35	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
36	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:37 Logic programming Conjunctive normal form Local search Boolean satisfiability problem DPLL algorithm Theoretical computer science Constraint programming Declarative programming
37	Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:58:01 Unsatisfiable core Conjunctive normal form Resolution Five lemma Theorem Logic programming Unit propagation Automated proof checking Boolean satisfiability problem Logic Mathematics Automated theorem proving
38	Clause Elimination Procedures for CNF Formulas Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Software Technology, Delft University of Technology, The Netherlands Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:34:30 Automated theorem proving Mathematical logic Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Resolution Boolean satisfiability problem Unit propagation Theoretical computer science Logic Mathematics
39	Revisiting Hyper Binary Resolution Marijn J.H. Heule1,3 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Computer Science, The University of Texas at Austin, United States Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:06:39 Automated theorem proving Logic in computer science NP-complete problems Conjunctive normal form Resolution Unit propagation Boolean satisfiability problem Literal Transitivity Theoretical computer science Mathematical logic Mathematics
40	Covered Clause Elimination Marijn Heule∗ TU Delft, The Netherlands Matti J¨arvisalo† Univ. Helsinki, Finland Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:30:47 Automated theorem proving Logic in computer science NP-complete problems Logic programming Conjunctive normal form Boolean satisfiability problem Unit propagation Resolution Clause Theoretical computer science Mathematical logic Mathematics